Bulk Synchronous Parallelisation of Genetic Programming
نویسندگان
چکیده
Abstract. A parallel implementation of Genetic Programming (GP) is described, using the Bulk SynchronousParallel Programming (BSP) model, as implemented by the Oxford BSP library. Two approaches to the parallel implementation of GP are examined. The first is based on global parallelisation while the second implements the island model for evolutionary algorithms. It is shown that considerable speedup of the GP execution can be achieved and that the BSP model is very suitable for parallelisation of similar algorithms.
منابع مشابه
Programming Research Group A SCHEME FOR THE BSP SCHEDULING OF GENERIC LOOP NESTS
This report presents a scheme for the bulk-synchronous parallel (BSP) scheduling of generic, untightly nested loops. Being targeted at the BSP model of computation, the novel parallelisation scheme yields parallel code which is scalable, portable, and whose cost can be accurately analysed. The scheme comprises three stages: data dependence analysis and potential parallelism identiication, data ...
متن کاملSpeeding up Genetic Programming: A Parallel BSP implementation
A parallel implementation of Genetic Programming is described, using the Bulk Synchronous Parallel Programming (BSP) model, as implemented by the Oxford BSP library. It is shown that considerable speedup of the GP execution can be achieved. As the complexity and the size of the problem increases, the actual speedup can be improved (assuming a constant number of processors), since the communicat...
متن کاملSparse Matrix Computations on Bulk Synchronous Parallel Computers
The Bulk Synchronous Parallel (BSP) programming model is studied in the context of sparse matrix computations. As a case study, a BSP algorithm is developed for sparse Cholesky factorisation.
متن کاملSparse Matrix Computations on Bulk Synchronous Parallel Computers
The Bulk Synchronous Parallel (BSP) programming model is studied in the context of sparse matrix computations. As a case study, a BSP algorithm is developed for sparse Cholesky factorisation.
متن کاملA Heterogeneous Framework for the Global Parallelisation of Genetic Algorithms
There is a big need for the parallelisation of genetic algorithms. In this paper, a heterogeneous framework for the global parallelisation of genetic algorithms is presented. The framework uses a static all-worker parallel programming paradigm based on collective communication. It follows the single program multiple data parallel programming model. It utilises the power of parallel machines by ...
متن کامل